Shelling Coxeter-like complexes and sorting on trees
نویسندگان
چکیده
منابع مشابه
Shelling Coxeter-like Complexes and Sorting on Trees
In their work on ‘Coxeter-like complexes’, Babson and Reiner introduced a simplicial complex ∆T associated to each tree T on n nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that ∆T is (n− b−1)-connected when the tree has b leaves. We provide a shelling for the (n − b)skeleton of ∆T , thereby proving this conjecture. In the process, we introduce notions ...
متن کاملCoxeter-like complexes
Motivated by the Coxeter complex associated to a Coxeter system (W, S), we introduce a simplicial regular cell complex ∆(G, S) with a G-action associated to any pair (G, S) where G is a group and S is a finite set of generators for G which is minimal with respect to inclusion. We examine the topology of ∆(G, S), and in particular the representations of G on its homology groups. We look closely ...
متن کاملThe sorting order on a Coxeter group
Let (W,S) be an arbitrary Coxeter system. For each sequence ω = (ω1, ω2, . . .) ∈ S∗ in the generators we define a partial order—called the ω-sorting order—on the set of group elements Wω ⊆ W that occur as finite subwords of ω. We show that the ω-sorting order is a supersolvable join-distributive lattice and that it is strictly between the weak and strong Bruhat orders on the group. Moreover, t...
متن کاملCoxeter orbits and Brauer trees
We study the cohomology with modular coefficients of Deligne-Lusztig varieties associated to Coxeter elements. Under some torsion-free assumption on the cohomology we derive several results on the principal l-block of a finite reductive group G(Fq) when the order of q modulo l is assumed to be the Coxeter number. These results include the determination of the planar embedded Brauer tree of the ...
متن کاملShelling Hexahedral Complexes for Mesh Generation
We present a new approach for the generation of hexahedral finite element meshes for solid bodies in computer-aided design. The key idea is to use a purely combinatorial method, namely a shelling process, to decompose a topological ball with a prescribed surface mesh into combinatorial cubes, so-called hexahedra. The shelling corresponds to a series of graph transformations on the surface mesh ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2009
ISSN: 0001-8708
DOI: 10.1016/j.aim.2009.01.007